Power domination in splitting and degree splitting graph
نویسندگان
چکیده
A vertex set S is called a power dominating of graph G if every within the system monitored by following collection rules for grid monitoring. The domination number order minimal G. In this paper, we solve splitting and degree graph.
منابع مشابه
Domination in Degree Splitting Graphs
Let G = (V, E) be a graph with V = S1 S2 ...,St T where each Si is a set of vertices having at least two vertices and having the same degree and T = V Si. The degree splitting graph of G is denoted by DS(G) is obtained from G by adding vertices w1, w2, ..., wt and joining wi to each vertex of Si (1 i t). Let the vertices and the edges of a graph G are called the elements of G. In this...
متن کاملDomination Integrity of Line Splitting Graph and Central Graph of Path, Cycle and Star Graphs
The domination integrity of a connected graph G = (V (G), E(G)) is denoted as DI(G) and defined by DI(G) = min{|S| + m(G − S)}, where S is a dominating set and m(G − S) is the order of a maximum component of G− S. This paper discusses domination integrity of line splitting graph and central graph of some graphs.
متن کاملSplitting an Expander Graph
Let G V E be an r regular expander graph Certain algorithms for nding edge disjoint paths require the edges of G to be partitioned into E E E Ek so that the graphs Gi V Ei are each expanders In this paper we give a non constructive proof of a very good split plus an algorithm which improves on that given in Broder Frieze and Upfal Existence and construction of edge disjoint paths on expander gr...
متن کاملDistributed Degree Splitting, Edge Coloring, and Orientations
We study a family of closely-related distributed graph problems, which we call degree splitting, where roughly speaking the objective is to partition (or orient) the edges such that each node’s degree is split almost uniformly. Our findings lead to answers for a number of problems, a sampling of which includes: • We present a poly log n round deterministic algorithm for (2∆− 1) · (1 + o(1))-edg...
متن کاملImproved Distributed Degree Splitting and Edge Coloring
The degree splitting problem requires coloring the edges of a graph red or blue such that each node has almost the same number of edges in each color, up to a small additive discrepancy. The directed variant of the problem requires orienting the edges such that each node has almost the same number of incoming and outgoing edges, again up to a small additive discrepancy. We present deterministic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proyecciones
سال: 2021
ISSN: ['0716-0917', '0717-6279']
DOI: https://doi.org/10.22199/issn.0717-6279-4357-4641